Pattern Matching in Multiple Streams
نویسندگان
چکیده
We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m + s) words of space. For the k-mismatch and k-difference problems we give O(k) time solutions that require O(m + ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.
منابع مشابه
Towards Efficient Schema-Enhanced Pattern Matching over RDF Data Streams
Data streams, often seen as sources of events, have appeared on the Web. Event processing on the Web needs however to cope with the typical openness and heterogeneity of the Web environment. Semantic Web technology, meant to facilitate data integration in an open environment, can help to address heterogeneities across multiple streams. In this paper we discuss an approach towards efficient patt...
متن کاملOnline Dictionary Matching for Streams of XML Documents
We consider the online multiple-pattern matching problem for streams of XML documents, when the patterns are expressed as linear XPath expressions containing child operators (/), descendant operators (//) and wildcards (∗) but no predicates. For each document in the stream, the task is to determine all occurrences in the document of all the patterns. We present a general multiple-pattern-matchi...
متن کاملTop-k Pattern Matching Using an Information-Theoretic Criterion over Probabilistic Data Streams
As the development of data mining technologies for sensor data streams, more sophisticated methods for complex event processing are demanded. In the case of event recognition, since event recognition results may contain errors, we need to deal with the uncertainty of events. We therefore consider probabilistic event data streams with occurrence probabilities of events, and develop a pattern mat...
متن کاملA framework for event co-occurrence detection in event streams
This paper shows that characterizing co-occurrence between events is an important but non-trivial and neglected aspect of discovering potential causal relationships in multimedia event streams. First an introduction to the notion of event co-occurrence and its relation to co-occurrence pattern detection is given. Then a finite state automaton extended with a time model and event parameterizatio...
متن کاملAn Efficient Mechanism for Matching Multiple Patterns with Streamed Xml Data
Filtering XML data streams using efficient pattern matching algorithms is a fundamental ability for many datacentric applications and main purpose of the Template Matching sPecification Language (TMPL). In this paper extensions to the language are discussed that enable fomulating more powerful query patterns: The declarative type system, improved predicates, template references and sequence mat...
متن کامل